The minimal number of nodes in Chebyshev type quadrature formulas
نویسندگان
چکیده
منابع مشابه
On computing rational Gauss-Chebyshev quadrature formulas
We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...
متن کاملComputing rational Gauss-Chebyshev quadrature formulas with complex poles
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary complex poles outside [−1, 1]. This algorithm is based on the derivation of explicit expressions for the Chebyshev (para-)orthogonal rational functions.
متن کاملChebyshev series method for computing weighted quadrature formulas
In this paper we study convergence and computation of interpolatory quadrature formulas with respect to a wide variety of weight functions. The main goal is to evaluate accurately a definite integral, whose mass is highly concentrated near some points. The numerical implementation of this approach is based on the calculation of Chebyshev series and some integration formulas which are exact for ...
متن کاملOn Gauss-type quadrature formulas with prescribed nodes anywhere on the real line
In this paper, quadrature formulas on the real line with the highest degree of accuracy, with positive weights, and with one or two prescribed nodes anywhere on the interval of integration are characterized. As an application, the same kind of rules but with one or both (finite) endpoints being fixed nodes and one or two more prescribed nodes inside the interval of integration are derived. An e...
متن کاملAlmost - Interpolatory Chebyshev Quadrature
The requirement that a Chebyshev quadrature formula have distinct real nodes is not always compatible with the requirement that the degree of precision of an npoint formula be at least equal to n. This condition may be expressed as | \d\ \p = 0, 1 g p, where d (dx, ■ ■ ■ , d„) with Mo(w) ~ , -IT dj = 2w A iM ; = 1, 2, • • ■ , z!, ZJ ,_, Pj(io), j = 0, 1, • • • , are the moments of the weight fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 1993
ISSN: 0019-3577
DOI: 10.1016/0019-3577(93)90007-l